例句與造句

1. The equivalence of the two statements can be proven through the use of successive polynomial division.
2. Virtually every non-trivial algorithm relating to polynomials uses the polynomial division algorithm, the Risch algorithm included.
3. Polynomial division is way hairier than constant division so I am not sure I know how to implement it.
4. Note that this issue also arises in the polynomial division algorithm; this algorithm will fail if it cannot correctly determine whether coefficients vanish identically.
5. Among his work was an incomplete proof ( Abel Ruffini theorem ) that radicals ( 1799 ), and Ruffini's rule which is a quick method for polynomial division.
6. It's difficult to find polynomial division in a sentence. 用polynomial division造句挺難的
7. Various CRC standards extend the polynomial division algorithm by specifying an initial shift register value, a final exclusive OR step and, most critically, a bit ordering ( endianness ).
8. where and are the remainder and the quotient of the polynomial long division of by, and where is the minimal number of polynomial divisions ( never greater than ) needed to obtain a zero remainder.
9. The divisor of this polynomial remainder computation is a quadratic polynomial " z " " m ", so that all reductions can be reduced to polynomial divisions of cubic by quadratic polynomials.
10. In general, the receiver can use polynomial division to construct the unique polynomials p ( a ) and e ( a ), such that e ( a ) has degree less than the degree of g ( a ) and
11. Another corollary of the polynomial division with the remainder is the fact that every proper field, namely in the polynomial division step, which requires the leading coefficient of " q ", which is only known to be non-zero, to have an inverse.
12. Another corollary of the polynomial division with the remainder is the fact that every proper field, namely in the polynomial division step, which requires the leading coefficient of " q ", which is only known to be non-zero, to have an inverse.
13. When the polynomial division on the right side is carried out, the polynomial in the backshift operator applied to \ varepsilon _ t has an infinite order that is, an infinite number of lagged values of \ varepsilon _ t appear on the right side of the equation.
14. If no error has occurred during the transmission, that is, if r ( a ) = s ( a ), then the receiver can use polynomial division to determine the message polynomial p _ x ( a ) = r ( a ) / g ( a ).
15. A systematic method is to reduce by y-y _ 0 with long polynomial division repeatedly until either numerator or denominator becomes nonzero at y _ 0; faster in this case is to remember that y ^ 2-1 = ( y-1 ) ( y + 1 ) so the entire fraction immediately reduces to just 2 ( y + 1 ) .  talk ) 21 : 25, 26 February 2011 ( UTC)